A toolkit for constraint-based inference engines
Identifieur interne :
000002 ( PascalFrancis/Curation );
précédent :
000001;
suivant :
000003
A toolkit for constraint-based inference engines
Auteurs : TEE YONG CHEW [
Singapour] ;
M. Henz [
Singapour] ;
KA BOON NG [
Singapour]
Source :
-
Lecture notes in computer science [ 0302-9743 ] ; 2000.
RBID : Pascal:00-0288866
Descripteurs français
English descriptors
Abstract
Solutions to combinatorial search problems can benefit from custom-made constraint-based inference engines that go beyond depth-first search. Several constraint programming systems support the programming of such inference engines through programming abstractions. For example, the Mozart system for Oz comes with several engines, extended in dimensions such as interaction, visualization, and optimization. However, so far such extensions are monolithic in their software design, not catering for systematic reuse of components. We present an object-oriented modular architecture for building inference engines that achieves high reusability and supports rapid prototyping of search algorithms and their extensions. For the sake of clarity, we present the architecture in the setting of a C++ constraint programming library. The SearchToolKit, a search library for Oz based on the presented architecture, provides evidence for the practicality of the design.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1753 |
|---|
| A08 | 01 | 1 | ENG | @1 A toolkit for constraint-based inference engines |
|---|
| A09 | 01 | 1 | ENG | @1 PADL 2000 : practical aspects of declarative languages : Boston MA, 17-18 January 2000 |
|---|
| A11 | 01 | 1 | | @1 TEE YONG CHEW |
|---|
| A11 | 02 | 1 | | @1 HENZ (M.) |
|---|
| A11 | 03 | 1 | | @1 KA BOON NG |
|---|
| A12 | 01 | 1 | | @1 PONTELLI (Enrico) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 COSTA (Vítor Santos) @9 ed. |
|---|
| A14 | 01 | | | @1 National University of Singapore @2 Singapore 117543 @3 SGP @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 185-199 |
|---|
| A21 | | | | @1 2000 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-66992-2 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000087617780130 |
|---|
| A44 | | | | @0 0000 @1 © 2000 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 1 p.1/4 |
|---|
| A47 | 01 | 1 | | @0 00-0288866 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 Solutions to combinatorial search problems can benefit from custom-made constraint-based inference engines that go beyond depth-first search. Several constraint programming systems support the programming of such inference engines through programming abstractions. For example, the Mozart system for Oz comes with several engines, extended in dimensions such as interaction, visualization, and optimization. However, so far such extensions are monolithic in their software design, not catering for systematic reuse of components. We present an object-oriented modular architecture for building inference engines that achieves high reusability and supports rapid prototyping of search algorithms and their extensions. For the sake of clarity, we present the architecture in the setting of a C++ constraint programming library. The SearchToolKit, a search library for Oz based on the presented architecture, provides evidence for the practicality of the design. |
|---|
| C02 | 01 | X | | @0 001D02B03 |
|---|
| C03 | 01 | X | FRE | @0 Programmation logique avec contrainte @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Constraint logic programming @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Programación lógica con restricción @5 01 |
|---|
| C03 | 02 | 1 | FRE | @0 Programmation orientée objet @5 02 |
|---|
| C03 | 02 | 1 | ENG | @0 Object oriented programming @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Programmation fonctionnelle @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Functional programming @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Programación funcional @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Optimisation programme @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Program optimization @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Optimización programa @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Structure programme @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Program structure @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Estructura programa @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Règle inférence @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Inference rule @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Regla inferencia @5 06 |
|---|
| N21 | | | | @1 192 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International workshop on practical aspects of declarative languages @2 2 @3 Boston MA USA @4 2000-01-17 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000242
Links to Exploration step
Pascal:00-0288866
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A toolkit for constraint-based inference engines</title>
<author><name sortKey="Tee Yong Chew" sort="Tee Yong Chew" uniqKey="Tee Yong Chew" last="Tee Yong Chew">TEE YONG CHEW</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><country>Singapour</country>
</affiliation><author><name sortKey="Henz, M" sort="Henz, M" uniqKey="Henz M" first="M." last="Henz">M. Henz</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><country>Singapour</country>
</affiliation><author><name sortKey="Ka Boon Ng" sort="Ka Boon Ng" uniqKey="Ka Boon Ng" last="Ka Boon Ng">KA BOON NG</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><country>Singapour</country>
</affiliation><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0288866</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0288866 INIST</idno>
<idno type="RBID">Pascal:00-0288866</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000242</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000002</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A toolkit for constraint-based inference engines</title>
<author><name sortKey="Tee Yong Chew" sort="Tee Yong Chew" uniqKey="Tee Yong Chew" last="Tee Yong Chew">TEE YONG CHEW</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><country>Singapour</country>
</affiliation><author><name sortKey="Henz, M" sort="Henz, M" uniqKey="Henz M" first="M." last="Henz">M. Henz</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><country>Singapour</country>
</affiliation><author><name sortKey="Ka Boon Ng" sort="Ka Boon Ng" uniqKey="Ka Boon Ng" last="Ka Boon Ng">KA BOON NG</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><country>Singapour</country>
</affiliation><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Constraint logic programming</term>
<term>Functional programming</term>
<term>Inference rule</term>
<term>Object oriented programming</term>
<term>Program optimization</term>
<term>Program structure</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique avec contrainte</term>
<term>Programmation orientée objet</term>
<term>Programmation fonctionnelle</term>
<term>Optimisation programme</term>
<term>Structure programme</term>
<term>Règle inférence</term>
</keywords><front><div type="abstract" xml:lang="en">Solutions to combinatorial search problems can benefit from custom-made constraint-based inference engines that go beyond depth-first search. Several constraint programming systems support the programming of such inference engines through programming abstractions. For example, the Mozart system for Oz comes with several engines, extended in dimensions such as interaction, visualization, and optimization. However, so far such extensions are monolithic in their software design, not catering for systematic reuse of components. We present an object-oriented modular architecture for building inference engines that achieves high reusability and supports rapid prototyping of search algorithms and their extensions. For the sake of clarity, we present the architecture in the setting of a C++ constraint programming library. The SearchToolKit, a search library for Oz based on the presented architecture, provides evidence for the practicality of the design.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1753</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A toolkit for constraint-based inference engines</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>PADL 2000 : practical aspects of declarative languages : Boston MA, 17-18 January 2000</s1>
</fA09><fA11 i1="01" i2="1"><s1>TEE YONG CHEW</s1>
</fA11><fA11 i1="02" i2="1"><s1>HENZ (M.)</s1>
</fA11><fA11 i1="03" i2="1"><s1>KA BOON NG</s1>
</fA11><fA12 i1="01" i2="1"><s1>PONTELLI (Enrico)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>COSTA (Vítor Santos)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>National University of Singapore </s1>
<s2>Singapore 117543</s2>
<s3>SGP</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>185-199</s1>
</fA20><fA21><s1>2000</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-66992-2</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000087617780130</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>1 p.1/4</s0>
</fA45><fA47 i1="01" i2="1"><s0>00-0288866</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>Solutions to combinatorial search problems can benefit from custom-made constraint-based inference engines that go beyond depth-first search. Several constraint programming systems support the programming of such inference engines through programming abstractions. For example, the Mozart system for Oz comes with several engines, extended in dimensions such as interaction, visualization, and optimization. However, so far such extensions are monolithic in their software design, not catering for systematic reuse of components. We present an object-oriented modular architecture for building inference engines that achieves high reusability and supports rapid prototyping of search algorithms and their extensions. For the sake of clarity, we present the architecture in the setting of a C++ constraint programming library. The SearchToolKit, a search library for Oz based on the presented architecture, provides evidence for the practicality of the design.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B03</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Programmation logique avec contrainte</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="1" l="FRE"><s0>Programmation orientée objet</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="1" l="ENG"><s0>Object oriented programming</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Programmation fonctionnelle</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Functional programming</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Programación funcional</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Optimisation programme</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Program optimization</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Optimización programa</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Structure programme</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Program structure</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Estructura programa</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Règle inférence</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Inference rule</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Regla inferencia</s0>
<s5>06</s5>
</fC03><fN21><s1>192</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>International workshop on practical aspects of declarative languages</s1>
<s2>2</s2>
<s3>Boston MA USA</s3>
<s4>2000-01-17</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000002 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000002 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:00-0288866
|texte= A toolkit for constraint-based inference engines
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
